Superrational types
نویسندگان
چکیده
منابع مشابه
Perfect Prediction in Normal Form: Superrational Thinking Extended to Non-Symmetric Games
This paper introduces a new solution concept for non-cooperative games in normal form with no ties and with pure strategies: the Perfectly Transparent Equilibrium. The players are assumed to be Perfect Predictors, in the sense that their predictions are correct in all possible worlds. Concretely, this means that a player’s decision is perfectly correlated with its anticipation by other players,...
متن کامل: examining l2 teachers’ corrective feedback types in relation to learners’ uptake, proficiency levels, and context types
abstract this study investigates the teachers’ correction of students’ spoken errors of linguistic forms in efl classes, aiming at (a) examining the relationship between the learners’ proficiency level and the provision of corrective feedback types, (b) exploring the extent to which teachers’ use of different corrective feedback types is related to the immediate types of context in which err...
Session Types = Intersection Types + Union Types
We propose a semantically grounded theory of session types which relies on intersection and union types. We argue that intersection and union types are natural candidates for modeling branching points in session types and we show that the resulting theory overcomes some important defects of related behavioral theories. In particular, intersections and unions provide a native solution to the pro...
متن کاملSubtyping with Union Types, Intersection Types and Recursive Types II
This paper is a follow-up on previous work by the author on subtyping with (set-theoretic) union, intersection and recursive types. Previously, it was shown how types may be encoded as regular tree expressions/set constraints. This gave rise to a sound and complete decision procedure for type inclusion. The result was, however, limited to a rather speciic type language. In the work reported on ...
متن کاملSubtyping with Union Types, Intersection Types and Recursive Types
This paper is a follow-up on previous work by the author on sub-typing with (set-theoretic) union, intersection and recursive types. Previously, it was shown how types may be encoded as regular tree expressions/set constraints. This gave rise to a sound and complete decision procedure for type inclusion. The result was, however, limited to a rather speciic type language. In the work reported on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logic Journal of the IGPL
سال: 2019
ISSN: 1367-0751,1368-9894
DOI: 10.1093/jigpal/jzz007